Embedding Algorithm Research Articles

Reversible Image Fragile Watermarking with Dual Tampering Detection

The verification of image integrity has attracted increasing attention. Irreversible algorithms embed fragile watermarks into cover images to verify their integrity, but they are not reversible due to unrecoverable loss. In this paper, a new dual tampering detection scheme for reversible image fragile watermarking is proposed. The insect matrix reversible embedding algorithm is used to embed the watermark into the cover image. The cover image can be fully recovered when the dual-fragile-watermarked images are not tampered with. This study adopts two recovery schemes and adaptively chooses the most appropriate scheme to recover tampered data according to the square errors between the tampered data and the recovered data of two watermarked images. Tampering coincidence may occur when a large region of the fragile-watermarked image is tampered with, and the recovery information corresponding to the tampered pixels may be missing. The tampering coincidence problem is solved using image-rendering techniques. The experimental results show that the PSNR value of the watermarked image obtained using our scheme can reach 46.37 dB, and the SSIM value is 0.9942. In addition, high-accuracy tampering detection is achieved.

Scalable and unbiased sequence-informed embedding of single-cell ATAC-seq data with CellSpace.

Standard scATAC sequencing (scATAC-seq) analysis pipelines represent cells as sparse numeric vectors relative to an atlas of peaks or genomic tiles and consequently ignore genomic sequence information at accessible loci. Here we present CellSpace, an efficient and scalable sequence-informed embedding algorithm for scATAC-seq that learns a mapping of DNA k-mers and cells to the same space, to address this limitation. We show that CellSpace captures meaningful latent structure in scATAC-seq datasets, including cell subpopulations and developmental hierarchies, and can score transcription factor activities in single cells based on proximity to binding motifs embedded in the same space. Importantly, CellSpace implicitly mitigates batch effects arising from multiple samples, donors or assays, even when individual datasets are processed relative to different peak atlases. Thus, CellSpace provides a powerful tool for integrating and interpreting large-scale scATAC-seq compendia.

Text steganography: enhanced character-level embedding algorithm using font attribute with increased resilience to statistical attacks

Text steganography: enhanced character-level embedding algorithm using font attribute with increased resilience to statistical attacks

VCGERG

Vulnerability can lead to data loss, privacy leakage and financial loss. Accurate detection and identification of vulnerabilities is essential to prevent information leakage and APT attacks. This paper explores the possibility of digging the valuable information in vulnerability reports deeply. We propose a new model, VCGERG, which products a graph using key information from vulnerability reports and embeds the graph into the vector space using a keywords-LINE graph embedding algorithm based on the attention of neighboring nodes. VCGERG model uses the OVR random forest algorithm to classify vulnerabilities. Our model can get the complicated local and global information of the graph in large-scale dataset and achieve better results. In order to verify the effectiveness of our model, it is evaluated on many experiments. Compared with other models, our method has a higher accuracy rate of 0.975.

Steganographic Techniques for High-Capacity Covert Communication in Images and Videos

Abstract: This paper investigates advanced steganographic techniques tailored for high-capacity covert communication within images and videos. Traditional approaches are limited by low embedding capacity and susceptibility to detection. To address these challenges, cutting-edge methods including adaptive embedding algorithms, content-aware techniques, and deep learningbased approaches are explored. The research emphasizes the importance of balancing embedding capacity, security, and perceptual quality. It also discusses steganalysis implications and strategies for mitigating detection risks. By reviewing existing literature, this paper offers insights into state-of-the-art steganography for covert communication. Understanding these methods enables the development of more robust and secure communication systems to meet evolving challenges in information security and privacy.

Particle Swarm Optimization for 5g and Beyond

Network embedding assigns nodes in a network to low dimensional representations and effectively preserves the network structure. Recently, a significant amount of progresses has been made toward this emerging network analysis paradigm. In this survey, we focus on categorizing and then reviewing the current development on network embedding methods, and point out its future research directions. We first summarize the motivation of network embedding. Particle Swarm Optimization (PSO) algorithm is used as the proposed method. We discuss the classical graph embedding algorithms on cognitive radio environment and their relationship with network embedding. Afterwards and primarily, we provide a comprehensive overview of a large number of networks embedding methods in a systematic manner, covering the structure- and property-preserving network embedding methods, the network embedding methods with side information and the advanced information preserving network embedding methods. Moreover, several evaluation approaches for network embedding and some useful online resources, including the network data sets and software, are reviewed, too. Finally, we discuss the framework of exploiting these network embedding methods to build an effective system and point out some potential future directions. Key Word: Particle Swarm Optimization (PSO), Beyond 5G (B5G), Internet of Think (IOT), Machine Learning (ML)etc..

Study of the Spatiotemporal Distribution Characteristics of Rainfall Using Hybrid Dimensionality Reduction-Clustering Model: A Case Study of Kunming City, China

In recent years, the frequency and intensity of global extreme weather events have gradually increased, leading to significant changes in urban rainfall patterns. The uneven distribution of rainfall has caused varying degrees of water security issues in different regions. Accurately grasping the spatiotemporal distribution patterns of rainfall is crucial for understanding the hydrological cycle and predicting the availability of water resources. This study collected rainfall data every five minutes from 62 rain gauge stations in the main urban area of Kunming City from 2019 to 2021, constructing an unsupervised hybrid dimensionality reduction-clustering (HDRC) model. The model employs the Locally Linear Embedding (LLE) algorithm from manifold learning for dimensionality reduction of the data samples and uses the dynamic clustering K-Means algorithm for cluster analysis. The results show that the model categorizes the rainfall in the Kunming area into three types: The first type has its rainfall center distributed on the north shore of Dian Lake and the southern part of Kunming’s main urban area, with spatial dynamics showing the rainfall distribution gradually developing from the Dian Lake water body towards the land. The second type’s rainfall center is located in the northern mountainous area of Kunming, with a smaller spatial dynamic change trend. The water vapor has a relatively fixed and concentrated rainfall center due to the orographic uplift effect of the mountains. The third type’s rainfall center is located in the main urban area of Kunming, with this type of rainfall showing smaller variations in all indicators, mainly occurring in May and September when the temperature is lower, related to the urban heat island effect. This research provides a general workflow for spatial rainfall classification, capable of mining the spatiotemporal distribution patterns of regional rainfall based on extensive data and generating typical samples of rainfall types.

Comparative single-cell multiplex immunophenotyping of therapy-naive patients with rheumatoid arthritis, systemic sclerosis, and systemic lupus erythematosus shed light on disease-specific composition of the peripheral immune system.

Systemic autoimmune diseases (SADs) are a significant burden on the healthcare system. Understanding the complexity of the peripheral immunophenotype in SADs may facilitate the differential diagnosis and identification of potential therapeutic targets. Single-cell mass cytometric immunophenotyping was performed on peripheral blood mononuclear cells (PBMCs) from healthy controls (HCs) and therapy-naive patients with rheumatoid arthritis (RA), progressive systemic sclerosis (SSc), and systemic lupus erythematosus (SLE). Immunophenotyping was performed on 15,387,165 CD45+ live single cells from 52 participants (13cases/group), using an antibody panel to detect 34 markers. Using the t-SNE (t-distributed stochastic neighbor embedding) algorithm, the following 17 main immune cell types were determined: CD4+/CD57- T cells, CD4+/CD57+ T cells, CD8+/CD161- T cells, CD8+/CD161+/CD28+ T cells, CD8dim T cells, CD3+/CD4-/CD8- T cells, TCRγ/δ T cells, CD4+ NKT cells, CD8+ NKT cells, classic NK cells, CD56dim/CD98dim cells, B cells, plasmablasts, monocytes, CD11cdim/CD172dim cells, myeloid dendritic cells (mDCs), and plasmacytoid dendritic cells (pDCs). Seven of the 17 main cell types exhibited statistically significant frequencies in the investigated groups. The expression levels of the 34 markers in the main populations were compared between HCs and SADs. In summary, 59 scatter plots showed significant differences in the expression intensities between at least two groups. Next, each immune cell population was divided into subpopulations (metaclusters) using the FlowSOM (self-organizing map) algorithm. Finally, 121 metaclusters (MCs) of the 10 main immune cell populations were found to have significant differences to classify diseases. The single-cell T-cell heterogeneity represented 64MCs based on the expression of 34 markers, and the frequency of 23 MCs differed significantly between at least twoconditions. The CD3- non-T-cell compartment contained 57 MCs with 17 MCs differentiating at least two investigated groups. In summary, we are the first to demonstrate the complexity of the immunophenotype of34markers over 15 million single cells in HCs vs. therapy-naive patients withRA, SSc, and SLE. Disease specific population frequencies or expression patterns of peripheral immune cells provide a single-cell data resource to the scientific community.

Gaussian-kernel weighted neighborhood preserving embedding algorithm and its application in fault detection

Abstract Fault detection in industrial processes is essential for enhancing production safety. Despite the application of the neighborhood preserving embedding (NPE) algorithm in fault detection as a manifold learning technique, a notable limitation exists—NPE overlooks local geometric structure, leading to suboptimal fault detection and occasional false alarms. This paper introduces the Gaussian kernel weighted neighborhood preserving embedding (KW-NPE) algorithm to address this challenge. Specifically designed for precise weight assignment in local structures, KW-NPE strategically employs the Gaussian kernel method to project the spatial neighborhood set and capture comprehensive local structural characteristics. The weight assignment, dependent on feature values, enhances the retention of intrinsic structure during dimensionality reduction. A novel objective function further augments this process.To assess performance, a comprehensive composite index (CI) is introduced in a case study, amalgamating the false alarm rate (FAR) and fault detection rate (FDR). The effectiveness of the KW-NPE algorithm is demonstrated through extensive simulations and its application to the Tennessee Eastman (TE) process dataset, highlighting its superiority over conventional approaches.

Graph Representations for Reinforcement Learning

Graph analysis is becoming increasingly important due to the expressive power of graph models and the efficient algorithms available for processing them. Reinforcement Learning is one domain that could benefit from advancements in graph analysis, given that a learning agent may be integrated into an environment that can be represented as a graph. Nevertheless, the structural irregularity of graphs and the lack of prior labels make it difficult to integrate such a model into modern Reinforcement Learning frameworks that rely on artificial neural networks. Graph embedding enables the learning of low-dimensional vector representations that are more suited for machine learning algorithms, while retaining essential graph features. This paper presents a framework for evaluating graph embedding algorithms and their ability to preserve the structure and relevant features of graphs by means of an internal validation metric, without resorting to subsequent tasks that require labels for training. Based on this framework, three defined algorithms that meet the necessary requirements for solving a specific problem of Reinforcement Learning in graphs are selected, analyzed, and compared. These algorithms are Graph2Vec, GL2Vec, and Wavelet Characteristics, with the latter two demonstrating superior performance.

Hybrid watermarking and encryption techniques for securing three-dimensional information

A hybrid digital watermarking and encryption technique based on the Computer Generated Holography (CGH) and fractional Fourier transform (FRFT) combined with singular value decomposition (SVD) algorithm is proposed for securing three-dimensional (3D) information. Initially, hierarchical 3D information is encrypted using the angular spectrum diffraction method and a random phase key. This process yields a binary real valued CGH, where incorporating a random phase key broadens the key space and adds complexity, effectively scrambling and concealing the 3D information. Subsequently, the encrypted binary real valued CGH is embedded into the host image as a watermark using the FRFT-SVD algorithm. This hybrid approach enhances the security of the watermarking process. In the final step, the CGH watermark is extracted using the inverse operation of the embedding algorithm. Applying the correct optical key and angular spectrum inverse algorithm successfully reconstructs the 3D information. The watermark algorithm’s efficiency significantly improves by leveraging the rapid computational speed and high focusing capabilities of the FRFT. Additionally, integrating SVD enhances the image’s resistance to geometric attacks, thereby improving the algorithm’s invisibility and robustness. The proposed scheme effectively achieves the encryption and digital watermarking of 3D information. Simulation results substantiate the presented watermarking scheme’s efficacy and robustness.

Enabling high fault-tolerant embedding capability of alternating group graphs

The Hamiltonian path/cycle serves as a robust tool for transmitting messages within parallel and distributed systems. However, the prevalent device-intensive nature of these systems often leads to the occurrence of faults. Tackling the critical challenge of tolerating numerous faults when constructing Hamiltonian paths and cycles in these systems is of utmost significance. The alternating group graph AGn is a suitable interconnection network for building parallel and distributed systems due to its outstanding topological properties. Many studies have been dedicated to the fault-tolerant embedding of Hamiltonian paths and cycles in AGn, but they all fail to reach the desired level of fault-tolerance. In this paper, we aim to enhance the edge fault-tolerant embedding capability of AGn by leveraging a newly emerged fault model, called the Partitioned Edge Fault (PEF) model. We prove the existence of Hamiltonian paths/cycles tolerating large-scale edge faults in AGn under the PEF model. Additionally, we propose a fault-tolerant Hamiltonian path embedding algorithm for AGn under the PEF model and validate its effectiveness through experiments. To gauge the significance of each missed edge, we conduct experimental calculations for the average path length of every edge along the Hamiltonian path produced by the proposed embedding algorithm. Furthermore, the fault-tolerance comparison and experimental analysis reveal that our results improve the fault-tolerant embedding capability of AGn from a linear level to an exponential one. To our knowledge, this is the first time that a Hamiltonian path/cycle embedding approach is proposed and actually implemented for AGn with large-scale edge faults.

A novel local linear embedding algorithm via local mutual representation for bearing fault diagnosis

The locally linear embedding algorithm (LLE) mainly extracts significant features by mining the local neighborhood structure of the data. However, when the data exhibit strong nonlinearity in high-dimensional space, the single neighborhood structure of the LLE algorithm may not accurately capture the local linear relationships between instances, which degrades the performances of the LLE. Therefore, we propose a multi-structure neighborhood locally linear embedding algorithm via local mutual representation (LMR-LLE). Firstly, in each neighborhood, multiple local neighborhood structures of one instance are mined via local mutual representation to enhance the interconnectivity between the instances. Furthermore, the multiple neighborhood structures are fused in the low-dimensional space to construct a global reconstruction model, and the ultimate significant features are acquired by determining the model’s optimal solution. Finally, the extracted features are fed into a classifier for bearing fault diagnosis. Extensive experiments on two rolling bearing datasets illustrate that the LMR-LLE based diagnosis method has better performance accuracy than conventional LLE-based algorithms.

DHONE: Density-based higher-order network embedding

Studies have indicated that focusing solely on pairwise interactions between two nodes disregards the associativity among multi-nodes in the network’s local structure. This associativity can be seen as dependencies among nodes, where certain edges’ presence depends on the path leading to it. Examinations on diverse datasets have approved that the variable order of chained dependencies allows for the preservation of structure information, which enables the reconstruction of the original network into a Higher-Order Network (HON) with improved quality of network representation. This paper proposes a Density-based Higher-Order Network Embedding (DHONE) algorithm, which integrates the concept of higher-order density into the network-embedding process in order to classify the contribution of different orders of dependencies. Through the construction of a novel and effective higher-order adjacency matrix, DHONE steadily improves the accuracy of network representation learning. Experimental results demonstrate DHONEs proficiency in improving embedding accuracy and overall algorithm robustness. Furthermore, grounded in the concept of higher-order density proposed herein, numerous dependencies have been discerned within the network generated from trajectories, potentially indicating the role of multi-node structures in networks.

Comparing semantic representation methods for keyword analysis in bibliometric research

Semantic representation methods play a crucial role in text mining tasks. Although numerous approaches have been proposed and compared in text mining research, the comparison of semantic representation methods specifically for publication keywords in bibliometric studies has received limited attention. This lack of practical evidence makes it challenging for researchers to select suitable methods to obtain keyword vectors for downstream bibliometric tasks, potentially hindering the achievement of optimal results. To address this gap, this study conducts an experimental comparison of various typical semantic representation methods for keywords, aiming to provide quantitative evidence for bibliometric studies. The experiment focuses on keyword clustering as the fundamental task and evaluates 22 variations of five typical methods across four scientific domains. The methods compared are co-word matrix, co-word network, word embedding, network embedding, and “semantic + structure” integration. The comparison is based on fitting the clustering results of these methods with the “evaluation standard” specific to each domain. The empirical findings demonstrate that the co-word matrix exhibits subpar performance, whereas the co-word network and word embedding techniques display satisfactory performance. Among the five network embedding algorithms, LINE and Node2Vec outperform DeepWalk, Struc2Vec, and SDNE. Remarkably, both the “pre-training and fine-tuning” model and the “semantic + structure” model yield unsatisfactory results in terms of performance. Nevertheless, even with variations in the performance of these methods, no singular approach stands out as universally superior. When selecting methods in practical applications, comprehensive consideration of factors such as corpus size and semantic cohesion of domain keywords is crucial. This study advances our understanding of semantic representation methods for keyword analysis and contributes to the advancement of bibliometric analysis by providing valuable recommendations for researchers in selecting appropriate methods.

An ensemble technique to predict Parkinson's disease using machine learning algorithms

Parkinson's Disease (PD) is a progressive neurodegenerative disorder affecting motor and non-motor symptoms. Its symptoms develop slowly, making early identification difficult. Machine learning has a significant potential to predict Parkinson's disease on features hidden in voice data. This work aimed to identify the most relevant features from a high-dimensional dataset, which helps accurately classify Parkinson's Disease with less computation time. Three individual datasets with various medical features based on voice have been analyzed in this work. An Ensemble Feature Selection Algorithm (EFSA) technique based on filter, wrapper, and embedding algorithms that pick highly relevant features for identifying Parkinson's Disease is proposed, and the same has been validated on three different datasets based on voice. These techniques can shorten training time to improve model accuracy and minimize overfitting. We utilized different ML models such as K-Nearest Neighbors (KNN), Random Forest, Decision Tree, Support Vector Machine (SVM), Bagging Classifier, Multi-Layer Perceptron (MLP) Classifier, and Gradient Boosting. Each of these models was fine-tuned to ensure optimal performance within our specific context. Moreover, in addition to these established classifiers, we proposed an ensemble classifier is found on a high optimal majority of the votes. Dataset-I achieves classification accuracy with 97.6 %, F1-score 97.9 %, precision with 98 % and recall with 98 %. Dataset-II achieves classification accuracy 90.2 %, F1-score 90.2 %, precision 90.2 %, and recall 90.5 %. Dataset-III achieves 83.3 % accuracy, F1-score 83.3 %, precision 83.5 % and recall 83.3 %. These results have been taken using 13 out of 23, 45 out of 754, and 17 out of 46 features from respective datasets. The proposed EFSA model has performed with higher accuracy and is more efficient than other models for each dataset.

K-SpecPart: Supervised Embedding Algorithms and Cut Overlay for Improved Hypergraph Partitioning

K-SpecPart: Supervised Embedding Algorithms and Cut Overlay for Improved Hypergraph Partitioning

Power quality disturbances classification with imbalanced/insufficient samples based on WGAN-GP-SA and DCNN

The accurate identification of power quality disturbance signals (PQDs) is of great importance to ensure the safe and stable operation of power systems. Considering that there are insufficient samples and imbalance samples of power quality disturbance signals in real systems, the hybrid classification method based on WGAN-GP-SA (Wasserstein generative adversarial networks with gradient penalty and Squeeze-and-Excitation block with atrous spatial pyramid pooling module) and DCNN (deep convolutional neural network) is proposed for recognition of PQDs. Firstly, time-frequency features are extracted by combining improved Kalman and continuous wavelet transforms (CWT); secondly, the original training time-frequency maps are expanded by using WGAN-GP-SA, which can learn the distribution of real data and generate similar samples, and PSNR, SSIM, FID and other indexes are introduced for evaluation of generated data; finally, classification experiments are conducted on two data sets using DCNN, and simulation results show that the accuracy is improved by 2.82% compared with the original data without augmentation. Furthermore, t-distributed stochastic neighbor embedding algorithm (t-SNE) is introduced for visually analysing of classification performance of various datasets, and the visualization indicates the superiority of the hybrid classification method.

Hub‐aware random walk graph embedding methods for classification

AbstractIn the last two decades, we are witnessing a huge increase of valuable big data structured in the form of graphs or networks. To apply traditional machine learning and data analytic techniques to such data it is necessary to transform graphs into vector‐based representations that preserve the most essential structural properties of graphs. For this purpose, a large number of graph embedding methods have been proposed in the literature. Most of them produce general‐purpose embeddings suitable for a variety of applications such as node clustering, node classification, graph visualization and link prediction. In this article, we propose two novel graph embedding algorithms based on random walks that are specifically designed for the node classification problem. Random walk sampling strategies of the proposed algorithms have been designed to pay special attention to hubs–high‐degree nodes that have the most critical role for the overall connectedness in large‐scale graphs. The proposed methods are experimentally evaluated by analyzing the classification performance of three classification algorithms trained on embeddings of real‐world networks. The obtained results indicate that our methods considerably improve the predictive power of examined classifiers compared with currently the most popular random walk method for generating general‐purpose graph embeddings (node2vec).

MTS2Graph: Interpretable multivariate time series classification with temporal evolving graphs

Conventional time series classification approaches based on bags of patterns or shapelets face significant challenges in dealing with a vast amount of feature candidates from high-dimensional multivariate data. In contrast, deep neural networks can learn low-dimensional features efficiently, and in particular, convolutional neural networks have shown promising results in classifying multivariate time series data. A key factor in the success of deep neural networks is this astonishing expressive power. However, this power comes at the cost of complex, black-boxed models, conflicting with the goals of building reliable and human-understandable models. In this work11The code can be found at https://github.com/raneeny/MTS2Graph., we introduce a new interpretable framework for multivariate time series data that by extracting and clustering the input quantifies the contribution of time-varying input variables and each signal’s role to the classification. We construct a graph that captures the temporal relationship between the extracted patterns for each layer and propose an effective merging strategy to aggregate those graphs into one. Finally, a graph embedding algorithm generates new representations of the created interpretable time-series features. Our extensive experiments indicate the benefit of our time-aware graph-based representation in multivariate time series classification while enriching them with more interpretability.